package com.dyz.leetcode._20_dynamicProgramming._1143;

public class _1143_longestCommonSubsequence01 {

    public int longestCommonSubsequence(String text1, String text2) {

        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m+1][n+1];

        //状态转移方程
        // text1.charAt(i-1) == text2.charAt(j-1)  dp[i][j] = 1+ dp[i-1][j-1]
        //text1.charAt(i-1) != text2.charAt(j-1)   dp[i][j] =Math.max(dp[i-1][j], dp[i][j-1])
        for (int i = 1; i <=m ; i++) {
            for (int j = 1; j <=n ; j++) {
                if(text1.charAt(i-1)==text2.charAt(j-1)){
                    dp[i][j] = 1+dp[i-1][j-1];
                }else {
                    dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }


}
